Improved Semidefinite Programming Bound on Sizes of Codes
نویسندگان
چکیده
منابع مشابه
Improved Linear Programming Bounds on Sizes of Constant-Weight Codes
Let A(n, d, w) be the largest possible size of an (n, d, w) constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on A(n, d, w) for n ≤ 28. The used techniques allow us to give a simple proof of an important theorem of Delsarte which makes linear programming possible for binary codes.
متن کاملImproved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is the Johnson bound. We give a new upper bound which is at least as good as the Johnson bound for all values of and , and for each there are infinitely many values of for which the new bound is better than the Johnson bo...
متن کاملSemidefinite programming for permutation codes
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym(n). In particular, we compute orbits of ordered pairs on Sym(n) acted upon by conjugation and inversion, explore a block di-agonalization of the associated algebra, and obtain improved upper bounds on the size M (n, d) of permutation codes of lengths u...
متن کاملUniqueness of codes using semidefinite programming
For n, d, w ∈ N, let A(n, d, w) denote the maximum size of a binary code of word length n, minimum distance d and constant weight w. Schrijver recently showed using semidefinite programming that A(23, 8, 11) = 1288, and the second author that A(22, 8, 11) = 672 and A(22, 8, 10) = 616. Here we show uniqueness of the codes achieving these bounds. Let A(n, d) denote the maximum size of a binary co...
متن کاملBounds for projective codes from semidefinite programming
We apply the semidefinite programming method to derive bounds for projective codes over a finite field.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2277714